The Zarathustra Project

نویسنده

  • Herbert Hrachovec
چکیده

There is a widespread demand for general, all-purpose platforms for e-teaching. It is argued that such platforms are ill suited to explore the wide range of possibilities opened up by digital communication technologies, in particular by object oriented MOO servers. Drawing on the author’s use of a LambdaMOO server in teaching Friedrich Nietzsche’s “Also sprach Zarathustra” the innovative potential of interactive, virtual text-worlds is explored. Computer assisted teaching is an increasingly popular research topic. Recently I’ve been interviewed by journalists as well as graduate students collecting material for radio features or M.A. reports. It has been a painful experience. One is, of course, accustomed to the rule of slogans in media society. But it is difficult to surpass the simple-mindedness shown by self-appointed experts on e-teaching. The repertoire of questions one is usually asked is extremely limited: “What tools are you using?” “Which features are missing?” “How much time do you spend?” And technical expertise is often lacking. Vienna University, Austria’s largest, has just awarded its top prize for innovative teaching to a project based on a MSN community’s site running in the Seattle area. According to several participants recurring breakdowns of the remote server were quite frustrating. So, why did they pick this service in the first place? The reason given is instructive: Because Vienna University still lacks a single, comprehensive e-learning system. [1] This is the stuff disasters are made of. The superficiality of such attitudes is, if I may say so, deeply disturbing. E-learning is considered on a par with e-mail or e-banking: you need one, or at most a few, global standards governing a limited number of relevant transactions. In case your university cannot yet supply the necessary tools just join a convenient subnet somewhere else on the planet. It makes good sense to users of “hotmail.com”, but it is a problematic move when it comes to university teaching. One would expect academic teachers to show more concern for the uniqueness of context in learning environments. Scholarly freedom does, after all, imply autonomy in picking and transforming the required methodological apparatus. University-wide teaching systems should, therefore, be regarded with extreme caution. It does not follow that, just because all courses are (helpfully) registered in a database and graded according to (hopefully) common criteria, they conform to some set of simple pedagogical principles implemented by an all-purpose software platform.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetric Fewnomial Inequalities and Higher Order Convexity

We prove a difficult symmetric fewnomial inequality by proving a more general inequality which applies to all functions with nonnegative fourth derivative.

متن کامل

New Upper and Lower Bound Sifting Iterations

with fκ(s) as large as possible (resp. Fκ(s) as small as possible) given that the above inequality holds for all choices of A satisfying (1). Selberg [3] has shown (in a much more general context) that the functions fκ(s), Fκ(s) are continuous, monotone, and computable for s > 1, and that they tend to 1 exponentially as s goes to infinity. Let β = β(κ) be the infimum of s such that fκ(s) > 0. S...

متن کامل

Chromatic Numbers of Directed Hypergraphs with No “bad” Cycles

Definition 1. A directed hypergraph of uniformity k is a pair (V,E) with E ⊆ V k. The chromatic number of a directed hypergraph is the chromatic number of the associated undirected hypergraph, that is, the least number χ such that there exists a function f : V → [χ] such that for each edge e ∈ E, not all of f(e1), ..., f(ek) are equal. We’ll assume that no edge of E has any two coordinates equa...

متن کامل

Inequalities and Higher Order Convexity

We study the following problem: given n real arguments a1, ..., an and n real weights w1, ..., wn, under what conditions does the inequality w1f(a1) + w2f(a2) + · · ·+ wnf(an) ≥ 0 hold for all functions f satisfying f (k) ≥ 0 for some given integer k? Using simple combinatorial techniques, we can prove many generalizations of theorems ranging from the Fuchs inequality to the criterion for Schur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010